A unified approach to construct snarks with circular flow number 5
نویسندگان
چکیده
The well-known 5-flow Conjecture of Tutte, stated originally for integer flows, claims that every bridgeless graph has circular flow number at most 5. It is a classical result that the study of the 5-flow Conjecture can be reduced to cubic graphs, in particular to snarks. However, very few procedures to construct snarks with circular flow number 5 are known. In the first part of this paper, we summarise some of these methods and we propose new ones based on variations of the known constructions. Afterwards, we prove that all such methods are nothing but particular instances of a more general construction that we introduce into detail. In the second part, we consider many instances of this general method and we determine when our method permits to obtain a snark with circular flow number 5. Finally, by a computer search, we determine all snarks having circular flow number 5 up to 36 vertices. It turns out that all such snarks of order at most 34 can be obtained by using our method, and that the same holds for 96 of the 98 snarks of order 36 with circular flow number 5.
منابع مشابه
Treelike Snarks
In this talk we present snarks whose edges cannot be covered by fewer than five perfect matchings. Esperet and Mazzuoccolo found an infinite family of such snarks, generalising an example provided by Hägglund. We construct another infinite family, arising from a generalisation in a different direction. The proof that this family has the requested property is computer-assisted. In addition, we p...
متن کاملA Computational Approach to the Flow of Walter’s Liquid B′ through Annulus of Coaxial Porous Circular Cylinders for High Suction Parameter (RESEARCH NOTE)
The present investigation studies the behavior of steady flow of visco-elastic liquid between two porous coaxial circular cylinders, where both the cylinders are rotating with different uniform angular velocities about the common axis. In addition, the inner cylinder has uniform velocity along the axis and the visco-elastic fluid, which is a Walters liquid B′, is allowed to flow in the annulus....
متن کاملOdd 2-factored snarks
A snark is a cubic cyclically 4–edge connected graph with edge chromatic number four and girth at least five. We say that a graph G is odd 2–factored if for each 2–factor F of G each cycle of F is odd. In this paper, we present a method for constructing odd 2–factored snarks. In particular, we construct two new odd 2–factored snarks that disprove a conjecture by some of the authors. Moreover, w...
متن کاملCircular flow numbers of regular multigraphs
The circular ow number F c (G) of a graph G = (V; E) is the minimum r 2 Q such that G admits a ow with 1 (e) r ? 1, for each e 2 E. We determine the circular ow number of some regular multigraphs. In particular, we characterize the bipartite (2t + 1)-regular graphs (t 1). Our results imply that there are gaps for possible circular ow numbers for (2t + 1)-regular graphs, e.g. there is no cubic g...
متن کاملThe Circular Chromatic Index of Flower Snarks
We determine the circular chromatic index of flower snarks, by showing that χc(F3) = 7/2, χ ′ c(F5) = 17/5 and χ ′ c(Fk) = 10/3 for every odd integer k ≥ 7, where Fk denotes the flower snark on 4k vertices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018